Positional Constraints in Optimality Theory and Harmonic Grammar
نویسندگان
چکیده
The ability of weighted constraints to model certain patterns that elude ranked constraints has often been taken to be typologically problematic (e.g., Prince & Smolensky 1993/2004, Legendre, Sorace & Smolensky 2006). This paper argues that the greater power of weighted constraints can actually be advantageous, permitting a smaller set of more general constraints to be employed in the analysis of attested languages. With limitations on the set of constraints, the predicted typology is restricted beyond what is possible in OT where more, and more specific, constraints are necessary. These principled revisions to CON mean that the languages generated by Harmonic Grammar need not be a superset of those generated by Optimality Theory (see also Pater [this volume], Potts et al. 2010).
منابع مشابه
Biases in Harmonic Grammar: the road to restrictive learning
In the Optimality-Theoretic learnability and acquisition literature it has been proposed that certain classes of constraints must be biased toward particular rankings (e.g., Markedness >> IO-Faithfulness; Specific IO-Faithfulness >> General IO-Faithfulness). While sometimes difficult to implement efficiently or comprehensively, these biases are necessary to explain how learners acquire the most...
متن کاملWhen more choice means less freedom: a note on candidate sets and typologies
This is perhaps the kind of thing that seems obvious in hindsight, but we initially thought that our typology generation algorithm had a bug when it produced the following results: (1) Using the constraints ONSET, NOCODA, DEP-C, DEP-V, MAX to model the CV-syllable theory of Prince and Smolensky (1993:ch 6) over the 14 forms in the input set CV 3 = 3 i=1 {C, V} i (i.e., all strings of C and V up...
متن کاملOptimality Theory and the Problem of Constraint Aggregation
1. The Issue Of recent changes in linguistic theory, the shift from derivations to constraints is among the most substantive. Central to this is Optimality Theory (OT; Prince & Smolenksy 1993), which – unlike, e.g., Chomsky & Lasnik’s Filters or Pān. ini’s As.t.ādhyāȳı – claims that structural well-formedness (grammaticality) is enforced by sharply conflicting, mutually incompatible constraints...
متن کاملConvergence Properties of a Gradual Learning Algorithm for Harmonic Grammar
This paper investigates a gradual on-line learning algorithm for Harmonic Grammar. By adapting existing convergence proofs for perceptrons, we show that for any nonvarying target language, Harmonic-Grammar learners are guaranteed to converge to an appropriate grammar, if they receive complete information about the structure of the learning data. We also prove convergence when the learner incorp...
متن کاملTaking Primitive Optimality Theory Beyond the Finite State
Primitive Optimality Theory (OTP) (Eisner, 1997a; Albro, 1998), a computational model of Optimality Theory (Prince and Smolensky, 1993), employs a finite state machine to represent the set of active candidates at each stage of an Optimality Theoretic derivation, as well as weighted finite state machines to represent the constraints themselves. For some purposes, however, it would be convenient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013